P2P Overlay Maintenance Algorithm

An Enhanced Searching Algorithm over Unstructured Mobile P2P Overlay Networks

To discover objects of interest in unstructured peer-to-peer networks, the peers rely on flooding query messages which create incredible network traffic. This article evaluates the performance of an unstructured Gnutella-like protocol over mobile ad-hoc networks and proposes modifications to improve its performance. This paper offers an enhanced mechanism for an unstructured Gnutella-like netwo...

Gemini: Probabilistic Routing Algorithm in Structured P2P Overlay

In this paper, we propose a new structured overlay protocol, which is more efficient and scalable than previous ones. We call it Gemini, because its routing table consists of two parts, one containing nodes with common prefix and the other containing nodes with common suffix. Gemini routes messages to their destinations in just 2 hops, with a very high probability of 0.99. When running in a p2p...

3D P2P overlay over MANETs

Analysis of hybrid P2P overlay network topology

Modeling peer-to-peer (P2P) networks is a challenge for P2P researchers. In this paper, we provide a detailed analysis of large-scale hybrid P2P overlay network topology, using Gnutella as a case study. First, we re-examine the power-law distributions of the Gnutella network discovered by previous researchers. Our results show that the current Gnutella network deviates from the earlier power-la...

Estimating Churn in Structured P2P Overlay Networks

Structured peer-to-peer (P2P) networks have become an important alternative to the classic client-server architecture. Participating peers can join and leave the system at arbitrary times, a process which is known as churn. Many recent studies revealed that churn is one of the main problems faced by any Distributed Hash Table (DHT). As a countermeasure most DHT protocols have to invest a signif...